Indeterminate string inference algorithms
نویسندگان
چکیده
منابع مشابه
Conservative String Covering of Indeterminate Strings
We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T [1]T [2] . . . T [n], where T [i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. A conservative indeterminate string, is an indeterminate string where the number of indeterminate symbols in the positions of the string, i.e the non-...
متن کاملInferring an indeterminate string from a prefix graph
An indeterminate string (or, more simply, just a string) x = x[1..n] on an alphabet Σ is a sequence of nonempty subsets of Σ. We say that x[i1] and x[i2] match (written x[i1] ≈ x[i2]) if and only if x[i1]∩x[i2] 6= ∅. A feasible array is an array y = y[1..n] of integers such that y[1] = n and for every i ∈ 2..n, y[i] ∈ 0..n−i+1. A prefix table of a string x is an array π = π[1..n] of integers su...
متن کاملString Alignment in Grammatical Inference
This thesis is concerned with unsupervised learning of syntactic structure from plain text corpora by aligning sentences. Based on Harris’ (1951) linguistic notion of substitutability, sentences in a plain text corpus can be compared to each other and those parts that have similar context and in addition can be substituted for each other without resulting in ungrammatical sentences are consider...
متن کاملString Processing Algorithms
The thesis describes extensive studies on various algorithms for efficient string processing. Data available in/via computers are often of enormous size, and thus, it is significantly important and necessary to invent timeand space-efficient methods to process them. Most of such data are, in fact, stored and manipulated as strings. String matching is most fundamental in string processing, where...
متن کاملParallel String Matching Algorithms
String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.08.002